Constrained Multilinear Detection and Generalized Graph Motifs
نویسندگان
چکیده
منابع مشابه
Constrained multilinear detection for faster functional motif discovery
The GRAPH MOTIF problem asks whether a given multiset of colors appears on a connected subgraph of a vertex-colored graph. The fastest known parameterized algorithm for this problem is based on a reduction to the k-Multilinear Detection (k-MLD) problem: the detection of multilinear terms of total degree k in polynomials presented as circuits. We revisit k-MLD and define k-CMLD, a constrained ve...
متن کاملMultilinear generalized Radon transforms and point configurations
We study multilinear generalized Radon transforms using a graph-theoretic paradigm that includes the widely studied linear case. These provide a general mechanism to study Falconertype problems involving (k + 1)-point configurations in geometric measure theory, with k ≥ 2, including the distribution of simplices, volumes and angles determined by the points of fractal subsets E ⊂ Rd, d ≥ 2. If T...
متن کاملVisibility graph motifs
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of visibility graph motifs, smaller substructures that appear with characteristic frequencies. We develop ...
متن کاملProbably Optimal Graph Motifs
We show an O∗(2k)-time polynomial space algorithm for the k-sized Graph Motif problem. We also introduce a new optimization variant of the problem, called Closest Graph Motif and solve it within the same time bound. The Closest Graph Motif problem encompasses several previously studied optimization variants, like Maximum Graph Motif, Min-Substitute, and Min-Add. Moreover, we provide a piece of ...
متن کاملGraph-Induced Multilinear Maps from Lattices
Graded multilinear encodings have found extensive applications in cryptography ranging from non-interactive key exchange protocols, to broadcast and attribute-based encryption, and even to software obfuscation. Despite seemingly unlimited applicability, essentially only two candidate constructions are known (GGH and CLT). In this work, we describe a new graphinduced multilinear encoding scheme ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-9981-1